Secret sharing schemes for Multipartite access structures

Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. Secret sharing schemes are introduced to solve the problems for securing sensitive information. In this paper, we review our proposed hierarchical and compartmented secret sharing schemes. Later ideal and perfect disjunctive hierarchical secret sharing scheme, constructed based on the Maximum Distance Separable (MDS) codes, is proposed in this paper. The scheme is ideal as well as perfect. Also, size of the ground field for the proposed scheme is independent of the parameters of the access structure. Further, it is efficient and require O(n), where n is the number of participants.